Incompatible quartets, triplets, and characters
نویسندگان
چکیده
منابع مشابه
A Decomposition Theory for Phylogenetic Networks and Incompatible Characters
Phylogenetic networks are models of evolution that go beyond trees, incorporating non-tree-like biological events such as recombination (or more generally reticulation), which occur either in a single species (meiotic recombination) or between species (reticulation due to lateral gene transfer and hybrid speciation). The central algorithmic problems are to reconstruct a plausible history of mut...
متن کاملImproved Lower Bounds on the Compatibility of Multi-State Characters
We study a long standing conjecture on the necessary and sufficient conditions for the compatibility of multi-state characters: There exists a function f(r) such that, for any set C of r-state characters, C is compatible if and only if every subset of f(r) characters of C is compatible. We show that for every r ≥ 2, there exists an incompatible set C of ⌊ r 2 ⌋·⌈ r 2 ⌉+1 r-state characters such...
متن کاملSupervision quartets.
Lovers of classical music may disagree about many things, but if you ask them to name the ideal musical form they will almost all say it is the string quartet. There are many reasons why the quartet has this revered place in the musical repertoire. The intimacy of the form allows composers to express profound ideas and emotions that are more diluted in their symphonies, concertos and operas. Pr...
متن کاملTriplets
occurrence that the newspapers featured the event as "news." Keporters besieged both the home and school, with the result that the triplets found themselves in headlines, with their pictures and history on the front pages. In the school itself they received due recognition. Mere twins were ignored. Teachers journeyed from their several class-rooms to gaze upon "the triplets." Little children cr...
متن کاملThe Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets
The maximum rooted resolved triplets consistency problem takes as input a set R of resolved triplets and asks for a rooted phylogenetic tree that is consistent with the maximum number of elements in R. This paper studies the polynomial-time approximability of a generalization of the problem where in addition to resolved triplets, the input may contain fan triplets and forbidden triplets. To beg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms for Molecular Biology
سال: 2013
ISSN: 1748-7188
DOI: 10.1186/1748-7188-8-11